constraint logic programming

constraint logic programming
= CLP I
логическое программирование в ограничениях (с учётом ограничений)
разновидность программирования в ограничениях (constraint programming) и логического программирования, где машина логического вывода дополнена средствами разрешения ограничений, благодаря чему значительно уменьшается пространство поиска и ускоряется решение определённых классов задач, особенно задач планирования, маршрутизации, распределения и т. п. Например, множество ограничений типа x100, y40 позволит исключить из рассмотрения все значения, не удовлетворяющие этому требованию, при поиске решения для выражения КратчайшееРасстояние(x,y). Существует много экспериментальных и коммерческих языков CLP, например CHIP и Eclipse, созданы средства (устройства, машины) разрешения ограничений для ряда предметных областей - это арифметики целых, действительных, линейных рациональных чисел, булева арифметика и сравнение строк.
Syn:
см. тж. constraint solver, programming

Англо-русский толковый словарь терминов и сокращений по ВТ, Интернету и программированию. . 1998-2007.

Игры ⚽ Нужна курсовая?

Смотреть что такое "constraint logic programming" в других словарях:

  • Constraint logic programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computing …   Wikipedia

  • Concurrent constraint logic programming — is a version of constraint logic programming aimed primarily at programming concurrent processes rather than (or in addition to) solving constraint satisfaction problems. Goals in constraint logic programming are evaluated concurrently; a… …   Wikipedia

  • Logic programming — is, in its broadest sense, the use of mathematical logic for computer programming. In this view of logic programming, which can be traced at least as far back as John McCarthy s [1958] advice taker proposal, logic is used as a purely declarative… …   Wikipedia

  • Abductive logic programming — is a high level knowledge representation framework that can be used to solve problems declaratively based on abductive reasoning. It extends normal Logic Programming by allowing some predicates to be incompletely defined, declared as abducible… …   Wikipedia

  • Constraint programming — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computin …   Wikipedia

  • Constraint Handling Rules — (CHR) is a declarative programming language extension introduced in 1991[1][2] by Thom Frühwirth. Originally designed for developing (prototypes of) constraint programming systems, CHR is increasingly used as a high level general purpose… …   Wikipedia

  • Constraint satisfaction — In artificial intelligence and operations research, constraint satisfaction is the process of finding a solution to a set of constraints that impose conditions that the variables must satisfy. A solution is therefore a vector of variables that… …   Wikipedia

  • Programming paradigm — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concu …   Wikipedia

  • Programming in the large and programming in the small — Programming paradigms Agent oriented Automata based Component based Flow based Pipelined Concatenative Concurrent computin …   Wikipedia

  • Constraint satisfaction problem — Constraint satisfaction problems (CSP)s are mathematical problems defined as a set of objects whose state must satisfy a number of constraints or limitations. CSPs represent the entities in a problem as a homogeneous collection of finite… …   Wikipedia

  • CHIP (programming language) — CHIP (Constraint Handling in Prolog) is a constraint logic programming language developed by M. Dincbas in 1985 at ECRC. The commercially successful ILOG Solver was an offshoot of CHIP.[1] References ^ Francesca Rossi; Peter Van Beek; Toby Walsh… …   Wikipedia


Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»